Construction of fuzzy automata from fuzzy regular expressions

نویسندگان

  • Aleksandar Stamenkovic
  • Miroslav Ciric
چکیده

Li and Pedrycz [Y. M. Li, W. Pedrycz, Fuzzy finite automata and fuzzy regular expressions with membership values in lattice ordered monoids, Fuzzy Sets and Systems 156 (2005) 68–92] have proved fundamental results that provide different equivalentways to represent fuzzy languageswithmembership values in a lattice-orderedmonoid, and generalize the well-known results of the classical theory of formal languages. In particular, they have shown that a fuzzy language over an integral lattice-ordered monoid can be represented by a fuzzy regular expression if and only if it can be recognized by a fuzzy finite automaton. However, they did not give any effective method for constructing an equivalent fuzzy finite automaton from a given fuzzy regular expression. In this paper we provide such an effective method. Transforming scalars appearing in a fuzzy regular expressionα into letters of the new extended alphabet, we convert the fuzzy regular expression α to an ordinary regular expression αR. Then, starting from an arbitrary nondeterministic finite automaton A that recognizes the language ‖αR‖ represented by the regular expression αR, we construct fuzzy finite automataAα andA r α with the same or even lessnumber of states than the automatonA , which recognize the fuzzy language ‖α‖ represented by the fuzzy regular expression α. The starting nondeterministic finite automaton A can be obtained from αR using any of the well-known constructions for converting regular expressions to nondeterministic finite automata, such as Glushkov-McNaughton-Yamada’s position automaton, Brzozowski’s derivative automaton, Antimirov’s partial derivative automaton, or Ilie-Yu’s follow automaton.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Metamorphosis of Fuzzy Regular Expressions to Fuzzy Automata using the Follow Automata

To deal with system uncertainty, finite automata have been generalized into fuzzy automata. Stamenkovic and Ciric proposed an approach using the position automata for the construction of fuzzy automata from fuzzy regular expressions. There exist multifarious methodologies for the construction of finite automata from regular expressions known as Thompson construction, Antimirov partial derivativ...

متن کامل

Multidimensional fuzzy finite tree automata

This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...

متن کامل

BL-general fuzzy automata and minimal realization: Based on the associated categories

The present paper is an attempt to study the minimal BL-general fuzzy automata which realizes the given fuzzy behavior. Of two methods applied for construction of such automaton presented here, one has been based on Myhill-Nerode's theory while the other has been based on derivatives of the given fuzzy behavior. Meanwhile, the categories of BL-general fuzzy automata and fuzzy behavior, along wi...

متن کامل

TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES

We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...

متن کامل

Myhill-Nerode Fuzzy Congruences Corresponding to a General Fuzzy Automata

Myhill-Nerode Theorem is regarded as a basic theorem in the theories of languages and automata and is used to prove the equivalence between automata and their languages. The significance of this theorem has stimulated researchers to develop that on different automata thus leading to optimizing computational models. In this article, we aim at developing the concept of congruence in general fuzzy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Fuzzy Sets and Systems

دوره 199  شماره 

صفحات  -

تاریخ انتشار 2012